Reciprocation, Square Root, Inverse Square Root, and Some Elementary Functions Using Small Multipliers
نویسندگان
چکیده
ÐThis paper deals with the computation of reciprocals, square roots, inverse square roots, and some elementary functions using small tables, small multipliers, and, for some functions, a final alargeo (almost full-length) multiplication. We propose a method, based on argument reduction and series expansion, that allows fast evaluation of these functions in high precision. The strength of this method is that the same scheme allows the computation of all these functions. We estimate the delay, the size/number of tables, and the size/number of multipliers and compare with other related methods. Index TermsÐReciprocal, square root, inverse square root, logarithm, exponential, single-/double-precision operations, small multipliers, Taylor series.
منابع مشابه
Multiplier-less and Table-less Linear Approximation for Square-Related Functions
Square-related functions such as square, inverse square, square-root and inverse square-root operations are widely used in digital signal processing and digital communication algorithms, and their efficient realizations are commonly required to reduce the hardware complexity. In the implementation point of view, approximate realizations are often desired if they do not degrade performance signi...
متن کاملAlgorithms for implementing roots, inverse and inverse roots in hardware
In applications as in future MIMO communication systems a massive computation of complex matrix operations, such as QR decomposition, is performed. In these matrix operations, the functions roots, inverse and inverse roots are computed in large quantities. Therefore, to obtain high enough performance in such applications, efficient algorithms are highly important. Since these algorithms need to...
متن کاملImproving the accuracy of the fast inverse square root algorithm
We present improved algorithms for fast calculation of the inverse square root for single-precision floating-point numbers. The algorithms are much more accurate than the famous fast inverse square root algorithm and have the same or similar computational cost. The main idea of our work consists in modifying the NewtonRaphson method and demanding that the maximal error is as small as possible. ...
متن کاملOptimized Linear, Quadratic and Cubic Interpolators for Elementary Function Hardware Implementations
This paper presents a method for designing linear, quadratic and cubic interpolators that compute elementary functions using truncated multipliers, squarers and cubers. Initial coefficient values are obtained using a Chebyshev series approximation. A direct search algorithm is then used to optimize the quantized coefficient values to meet a user-specified error constraint. The algorithm minimiz...
متن کاملON THE SQUARE ROOT OF THE CENTRE OF THE HECKE ALGEBRA OF TYPE A ANDREW FRANCIS and LENNY JONES
In this paper we investigate non-central elements of the Iwahori-Hecke algebra of the symmetric group whose squares are central. In particular, we describe a commutative subalgebra generated by certain non-central square roots of central elements, and the generic existence of a rank-three submodule of the Hecke algebra contained in the square root of the centre, but not in the centre. The gener...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Computers
دوره 49 شماره
صفحات -
تاریخ انتشار 2000